منابع مشابه
on the spectra of reduced distance matrix of thorn graphs
let g be a simple connected graph and {v1, v2, …, vk} be the set of pendent (vertices ofdegree one) vertices of g. the reduced distance matrix of g is a square matrix whose (i,j)–entry is the topological distance between vi and vj of g. in this paper, we obtain the spectrumof the reduced distance matrix of thorn graph of g, a graph which obtained by attaching somenew vertices to pendent vertice...
متن کاملOn the distance spectra of some graphs
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the D-spectrum of G. The D-energy ED(G) of the graph G is the sum of the absolute values of its D-eigenvalues. Two (connected) graphs are said to be D-equienergetic if they have equal D-energies. The D-spectra of some graphs and their D-energies are calculated. A pair of D-equienergetic bipartite gra...
متن کاملDistance spectra and Distance energy of Integral Circulant Graphs
The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the ...
متن کاملINTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...
متن کاملReciprocal complementary distance spectra and reciprocal complementary distance energy of line graphs of regular graphs
The reciprocal complementary distance (RCD) matrix of a graphG is defined asRCD(G) = [rcij] where rcij = 1 1+D−dij if i 6= j and rcij = 0, otherwise, where D is the diameter of G and dij is the distance between the vertices vi and vj in G. The RCD-energy of G is defined as the sum of the absolute values of the eigenvalues of RCD(G). Two graphs are said to be RCDequienergetic if they have same R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.10.020